Kernel spectral clustering with memory effect
نویسندگان
چکیده
منابع مشابه
Kernel Spectral Clustering with Memory Effect
Evolving graphs describe many natural phenomena changing over time, such as social relationships, trade markets, methabolic networks etc. In this framework, performing community detection and analyzing the cluster evolution represents a critical task. Here we propose a new model for this purpose, where the smoothness of the clustering results over time can be considered as a valid prior knowled...
متن کاملCommunity detection using Kernel Spectral Clustering with memory
This work is related to the problem of community detection in dynamic scenarios, which for instance arises in the segmentation of moving objects, clustering of telephone traffic data, time-series micro-array data etc. A desirable feature of a clustering model which has to capture the evolution of communities over time is the temporal smoothness between clusters in successive time-steps. In this...
متن کاملKernel Cuts: MRF meets Kernel&Spectral Clustering
The log-likelihood energy term in popular model-fitting segmentation methods, e.g. [64, 14, 50, 20], is presented as a generalized “probabilistic” K-means energy [33] for color space clustering. This interpretation reveals some limitations, e.g. over-fitting. We propose an alternative approach to color clustering using kernel K-means energy with well-known properties such as non-linear separati...
متن کاملSpectral Kernel Methods for Clustering
In this paper we introduce new algorithms for unsupervised learning based on the use of a kernel matrix. All the information required by such algorithms is contained in the eigenvectors of the matrix or of closely related matrices. We use two different but related cost functions, the Alignment and the 'cut cost'. The first one is discussed in a companion paper [3], the second one is based on gr...
متن کاملKernel Spectral Clustering and applications
In this chapter we review the main literature related to kernel spectral clustering (KSC), an approach to clustering cast within a kernel-based optimization setting. KSC represents a least-squares support vector machine based formulation of spectral clustering described by a weighted kernel PCA objective. Just as in the classifier case, the binary clustering model is expressed by a hyperplane i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physica A: Statistical Mechanics and its Applications
سال: 2013
ISSN: 0378-4371
DOI: 10.1016/j.physa.2013.01.058